考虑弹体动态特性的机动效率约束导引律

针对考虑交会角和过载约束导引律在大机动时能量损失大的问题,提出一种考虑导弹机动效率的多约束制导律。应用最优二次型原理推导出考虑一阶弹体延迟的时变导引系数闭环次优制导形式,将导弹机动时刻阻力系数引入时变权系数,并通过迭代确定机动效率约束边界。将时变约束表示成剩余时间与弹体延迟时间的函数,代入制导指令,进行弹道仿真。结果表明,对于常值与机动目标,文中制导律与过载约束导引律同只考虑交会角约束的导引律相比,对目标均能实现末端弹道成型要求,而考虑机动效率的制导指令分配更为合理,在避免指令加速度饱和的同时有效降低了拦截末端速度损耗,提高制导精度与毁伤效果。且该制导律中时变权系数无须配平求解,在保证精度的同时极大地提高了迭代速度。     

Index policies for the routing of background jobs

Arriving (generic) jobs may be processed at one of several service stations, but only when no other (dedicated) jobs are waiting there. We consider the problem of how to route these incoming background jobs to make best use of the spare service capacity available at the stations. We develop an approximative approach to Whittle's proposal for restless bandits to obtain an index policy for routing. The indices concerned are increasing and nonlinear in the station workload. A numerical study testifies to the strong performance of the index policies developed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

On the uncapacitated K‐commodity network design problem with zero flow‐costs

Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n³) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n³) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

编队对潜作战中抗友邻舰干扰方法

针对编队远程水下警戒中拖曳线列阵声纳抗编队中友邻舰辐射噪声干扰问题,基于拖曳线列阵声纳的检测性能,由友邻干扰时空频特征,给出了产生干扰盲区与左右舷镜像源的原因。分析了两种抗友邻干扰"软补盲"方法的优缺点,并通过计算机仿真双舰编队在平行搜索且只有一条拖曳线列阵工作模式下,得到了未使用抗干扰和采用"软补盲"抗干扰方法后对于被动拖曳线列阵声纳检测性能产生的不同影响,并根据影响结果给出了平行搜索方式下使用"软补盲"抗干扰方法后的队形配置建议与作战指挥原则。     

航天测控通信系统可靠性分析的Krylov子空间投影算法

基于Markov模型对航天测控通信系统进行可靠性分析的过程中,若系统中测控通信设备数量较多,模型中的状态空间随设备数量呈指数增长,将会导致数值计算困难.提出了一种基于Krylov子空间技术的可靠性分析方法,将大规模问题投影至小规模子空间中,求得问题的近似解.实验结果证明,Krylov子空间方法的计算速度及精度优于Ross方法和前向Euler法(forward Euler method,FEM).     

基于改进多模滤波算法的控制系统故障诊断

应用分层多模自适应滤波算法对控制系统的故障进行诊断时,只能识别出故障的类型,如识别出是传感器还是执行器发生故障,并不能判定出故障的大小.提出一种改进分层多模自适应滤波算法,应用此算法可使分层多模自适应滤波算法不仅可以检测出控制系统的故障类型,而且能够确定发生故障的执行器局部故障程度.将此算法应用于某无人机控制系统的故障诊断,仿真结果验证了该方法的有效性.     

改进的前向信息修补算法及其应用

前向信息修补算法可以对离散动态贝叶斯网络的缺失数据进行预测,该算法只适用于所有观测节点是相互独立的网络,却不能处理观测节点有依赖关系网络的缺失数据。针对该算法的这一缺陷,提出了改进的前向信息修补算法,在分析离散动态贝叶斯网络的缺失数据具有二种基本形式的基础上,推导出了每种形式的相应预测公式。继而构建了用于识别威胁源离散动态贝叶斯网络的模型。仿真实验验证了改进的前向信息修补算法的有效性。     

屏蔽数据在新型截尾样本下系统的可靠性分析

当系统含有屏蔽数据时,在具有随机移走逐步增加型截尾模型下,讨论了部件寿命服从双参数指数分布的串联系统可靠性估计问题。设随机移走系统数服从二项分布,利用极大似然方法,Bayes理论及方法,推导出双参数指数部件参数、系统可靠性函数、失效率函数及移走概率的极大似然估计和Bayes估计。并利用Monte Carlo方法对两种估计结果进行了比较,表明Bayes估计较极大似然估计效果更优。     

水面舰艇对海作战可靠性的新型评价方法

针对水面舰艇对海作战网络的特点,基于复杂网络"反社区"性质,将对海作战网络描述成"反社区"有向赋权图。结合传统可靠性分析方法,提出了一种新的可靠性评价指标,进一步扩展了传统可靠性指标的4个特性,并通过实例仿真,证明了该指标的有效性。该方法将传统可靠性理论与复杂网络理论有效地结合起来,将进一步扩大复杂网络的适用范围。     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010